NORMAL MULTIMODAL LOGICS WITH INTERACTION AXIOMS A Tableau Calculus and Some (Un)Decidability Results
نویسنده
چکیده
In this paper we present a prefixed analytic tableau calculus for a wide class of normal multimodal logics; the calculus can deal in a uniform way with any logic in this class. To achieve this goal, we use a prefixed tableau calculus à la Fitting, where we explicitly represent accessibility relations between worlds by means of a graph and we use the characterizing axioms as rewriting rules. Such rules create new paths among worlds in the counter-model construction. The prefixed tableau method is, then, used to prove (un)decidability results about certain classes of multimodal logics.
منابع مشابه
A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results
In this paper we present a prefixed analytic tableau calculus for a class of normal multimodal logics and we present some results about decidability and undecidability of this class. The class is characterized by axioms of the form [t1] . . . [tn]φ ⊃ [s1] . . . [sm]φ, called inclusion axioms, where the ti’s and sj ’s are constants. This class of logics, called grammar logics, was introduced for...
متن کاملNormal Multimodal Logics: Automatic Deduction and Logic Programming Extension
In this thesis we work on normal multimodal logics, that are general modal systems with an arbitrary set of normal modal operators, focusing on the class of inclusion modal logics. This class of logics, first introduced by Fariñas del Cerro and Penttonen, includes some well-known non-homogeneous multimodal systems characterized by interaction axioms of the form [t1][t2] . . . [tn]φ ⊃ [s1][s2] ....
متن کاملNormal Multimodal Logics
This paper studies what we call normal multimodal logics, which are general modal systems with an arbitrary set of normal modal operators. We emphasize the importance of non-simple systems, for which some interaction axioms are considered. A list of such acceptable axioms is proposed, among which the induction axiom has a special behavior. The class of multimodal logics that can be built with t...
متن کاملA Fibred Tableau Calculus for Modal Logics of Agents
In [15,19] we showed how to combine propositional multimodal logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (graph & path), with the help of a scenario (The Friend’s Puzzle). Having d...
متن کاملCant Ext Ual Easoning Is N
The logic of context with the ist (c,p) modality has been proposed by McCarthy as a foundation for contextual reasoning. This paper shows that propositional logic of context is NP-complete and therefore more tractable than multimodal logics or Multi Language hierarchical logics which are PSPACE-complete, This result is given in a proof-theoretical way by providing a tableau calculus, which can ...
متن کامل